Computational complexity of network vulnerability analysis

Abstract Residual closeness is recently proposed as a vulnerability measure to characterize the stability of complex networks. essential in analysis networks, but costly compute. Currently, fastest known algorithms run polynomial time. Motivated by fast-growing need compute measures on new for computing node and edge residual are introduced this paper. Those reduce running times Θ(n 3 ) Θ (n 4 unweighted respectively, where n number nodes.